Continuity, computability, constructivity: from logic to algorithms 2014 (Preface to the special issue: Continuity, Computability, Constructivity: From Logic to Algorithms 2014)
نویسندگان
چکیده
The workshop was partially funded by the Faculty of Mathematics and Physics at the University of Ljubljana, the Institute for Mathematics, Physics and Mechanics, as well as the European Union. It was the fourth in a series of workshops aimed at bringing together researchers from exact real number computation, computable analysis, effective descriptive set theory, constructive analysis, and related fields. The overall objective is to apply logical methods in these disciplines to provide a sound foundation for obtaining exact and correct algorithms. At the same time, the conference was the third annual meeting of the COMPUTAL project, which is a research network between Europe, Russia, South Africa, and Japan funded by the European Union under the FP7-IRSES programme scheme.
منابع مشابه
Preface to the special issue: Continuity, computability, constructivity: from logic to algorithms 2013
HAJIME ISHIHARA†, MARGARITA KOROVINA‡, ARNO PAULY§, MONIKA SEISENBERGER¶ and DIETER SPREEN‖ †School of Information Science, Japan Advanced Institute of Science and Technology, 1-1 Asahidai, Nomi, Ishikawa 923-1292, Japan Email: [email protected] ‡A.P. Ershov Institute of Informatics Systems, Russian Academy of Science, Siberian Branch, Prospekt Lavrentev 6, Novosibirsk, 630090, Russia Email:...
متن کاملCompactness in constructive analysis revisited
In [5], [3] we have developed a unified Type 2 theory of computability and continuity and a theory of representations. In a third paper [6] representations useful for a new kind of constructive analysis were presented. As an application of these concepts we shall now consider constructive compactness. We introduce 'reasonable' representations of closed and compact sets and prove two different v...
متن کاملConstructivity, Computability, and Logic A Collection of Papers in Honour of the 60th Birthday of Douglas Bridges
Professor Bridges is not only an eminent mathematician, but also a distinguished intellectual with many interests outside mathematics; music and sport are two of his other passions. He has got a D.Sc. from Oxford University, and he is a Fellow of the Royal Society of New Zealand and a Corresponding Fellow of the Royal Society of Edinburgh. His research interests are very broad and include const...
متن کاملDesigning a Meta-Heuristic Algorithm Based on a Simple Seeking Logic
Nowadays, in majority of academic contexts, it has been tried to consider the highest possible level of similarities to the real world. Hence, most of the problems have complicated structures. Traditional methods for solving almost all of the mathematical and optimization problems are inefficient. As a result, meta-heuristic algorithms have been employed increasingly during recent years. In thi...
متن کاملRelative computability and uniform continuity of relations
A type-2 computable real function is necessarily continuous; and this remains true for computations relative to any oracle. Conversely, by the Weierstrass Approximation Theorem, every continuous f : [0; 1]→ R is computable relative to some oracle. In their search for a similar topological characterization of relatively computable multi-valued functions f : [0; 1] ⇒ R (also known as multi-functi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Logic & Analysis
دوره 9 شماره
صفحات -
تاریخ انتشار 2017